f(0) → s(0)
f(s(0)) → s(s(0))
f(s(0)) → *(s(s(0)), f(0))
f(+(x, s(0))) → +(s(s(0)), f(x))
f(+(x, y)) → *(f(x), f(y))
↳ QTRS
↳ DependencyPairsProof
f(0) → s(0)
f(s(0)) → s(s(0))
f(s(0)) → *(s(s(0)), f(0))
f(+(x, s(0))) → +(s(s(0)), f(x))
f(+(x, y)) → *(f(x), f(y))
F(+(x, y)) → F(y)
F(+(x, y)) → F(x)
F(+(x, s(0))) → F(x)
F(s(0)) → F(0)
f(0) → s(0)
f(s(0)) → s(s(0))
f(s(0)) → *(s(s(0)), f(0))
f(+(x, s(0))) → +(s(s(0)), f(x))
f(+(x, y)) → *(f(x), f(y))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
F(+(x, y)) → F(y)
F(+(x, y)) → F(x)
F(+(x, s(0))) → F(x)
F(s(0)) → F(0)
f(0) → s(0)
f(s(0)) → s(s(0))
f(s(0)) → *(s(s(0)), f(0))
f(+(x, s(0))) → +(s(s(0)), f(x))
f(+(x, y)) → *(f(x), f(y))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
F(+(x, y)) → F(y)
F(+(x, s(0))) → F(x)
F(+(x, y)) → F(x)
f(0) → s(0)
f(s(0)) → s(s(0))
f(s(0)) → *(s(s(0)), f(0))
f(+(x, s(0))) → +(s(s(0)), f(x))
f(+(x, y)) → *(f(x), f(y))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(+(x, y)) → F(y)
F(+(x, s(0))) → F(x)
F(+(x, y)) → F(x)
The value of delta used in the strict ordering is 13/8.
POL(s(x1)) = 1 + (4)x_1
POL(0) = 4
POL(F(x1)) = (1/2)x_1
POL(+(x1, x2)) = 13/4 + (5/2)x_1 + x_2
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
f(0) → s(0)
f(s(0)) → s(s(0))
f(s(0)) → *(s(s(0)), f(0))
f(+(x, s(0))) → +(s(s(0)), f(x))
f(+(x, y)) → *(f(x), f(y))